Update traversal of object trees for multiprocessor systems

ABSTRACT

A system may include a processor and memory that stores instructions to cause the processor to create a first set of objects in a first structure based on first data, where the first set of objects describes a graphical scene specified by the first data. The processor may add a command for at least one object, of the first set of objects, to a composite command that includes commands for the graphical scene and create a second set of objects in a second structure based on the first set of objects in the first structure and the composite command. The processor may receive second data, change one or more objects of the first set of objects based on the second data, and change one or more objects of the second set of objects based on the changes to the one or more objects of the first set of objects. The processor may further provide the changed second set of objects to a browser for rendering a new graphical scene.

RELATED APPLICATION

This application claims priority from and is a continuation-in-part (CIP) of U.S. patent application Ser. No. 12/059,312, filed Mar. 31, 2008, entitled “UPDATE TRAVERSAL OF OBJECT TREES FOR MULTIPROCESSOR SYSTEMS,” the entire disclosure of which is incorporated herein by reference.

BACKGROUND

Contemporary computer systems typically include multiprocessor systems, where one of the processors includes a general purpose processor (e.g., a central processing unit (CPU)) and another one of the processors includes a specialized processing unit. The specialized processing unit may include a dedicated processing unit designed to perform a specific function, and is typically used to offload time consuming tasks from the general purpose processor. The specialized processing unit is usually designed to perform the offloaded tasks more efficiently then the general purpose processor. Specialized processing units may include, for example, graphics processing units (GPUs), physics processing units (PPUs), or digital signal processors (DSPs). A GPU is one example of a specialized processing unit typically used in a multiprocessor system which includes a dedicated graphics rendering device that is designed to be efficient at manipulating and displaying computer graphics.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate one or more embodiments described herein and, together with the description, explain these embodiments. In the drawings,

FIGS. 1A and 1B are diagrams depicting an overview of exemplary embodiments described herein;

FIG. 2 is a diagram of a network according to an exemplary implementation;

FIG. 3 is a block diagram of a device according to an exemplary implementation;

FIG. 4 is an exemplary functional block diagram of the device;

FIG. 5 is a flowchart of an exemplary process for creating object trees for use in describing a graphical scene and for rendering the graphical scene via a GPU;

FIG. 6 is a diagram of an exemplary graphical user interface that may be implemented at a client;

FIG. 7 is a diagram of an exemplary object tree that describes a graphical scene;

FIG. 8 is a diagram that depicts the creation of a graphics rendering tree from the object tree of FIG. 7;

FIG. 9 is a flowchart of an exemplary process for creating a graphics rendering tree based on a corresponding object tree;

FIGS. 10-17 graphically depict an example of block 910 of FIG. 9;

FIGS. 18A and 18B graphically depict an example of block 920 of FIG. 9;

FIGS. 19-25 graphically depict an example of block 930 of FIG. 9;

FIG. 26 is a flowchart of an exemplary process for updating the object tree and graphics rendering tree;

FIG. 27 is a diagram of objects of an object tree along with their associated “dirty” bits according to one exemplary implementation;

FIG. 28 is a flowchart of an exemplary process for performing an update traversal of an object tree to revise the corresponding graphics rendering tree;

FIGS. 29-32B are diagrams depicting examples of blocks 2800, 2810 and 2820 of the exemplary process of FIG. 28;

FIGS. 33A-34B are diagrams depicting examples of block 2830 of the exemplary process of FIG. 28;

FIG. 35 is a flowchart of an exemplary process for rendering graphics based on a previously created graphics rendering tree;

FIG. 36 illustrates an example of a graphics plot rendered using a graphics rendering tree; and

FIG. 37 illustrates another example of a graphics plot rendered using a graphics rendering tree.

DETAILED DESCRIPTION

The following detailed description refers to the accompanying drawings. The same reference numbers in different drawings may identify the same or similar elements. Also, the following detailed description does not limit the invention.

Specialized processing units may utilize certain organizations, types and/or formats of data better than other organizations, types or formats of data. For example, a specialized processing unit may efficiently handle code objects having a certain organization. Code objects (hereinafter “objects”) may include pieces of software that are made up of modularized code, where the modules are referred to as “objects.” An “object” as the term is used herein refers to a self-contained entity that may consist of both data and manipulation procedures (e.g., functionality). An “object” is a basic building block of programs in object-oriented programming. Data associated with a given object may be set as properties of that object.

In object oriented programming, an object is a piece of code that accepts information and/or makes information available that is compliant with a known or published format (e.g., compliant with a published input or output interface). In object oriented programming, a programmer does not have to be concerned about, or have detailed knowledge of, the code that makes up a given object when the programmer wants to create other code that may use and/or interact with the object. The programmer only needs to make sure his code makes information available to the object in a compliant format and/or receives information from the object via a compliant format. Object oriented programming techniques allow complex programs (e.g., complex graphics programs) to be written by several individuals without requiring that one individual know the details of what is in an object developed by another individual.

Object oriented code may be implemented in an environment that allows objects to be arranged in formations, such as hierarchies. For example, a hierarchy may include objects arranged in a tree-like structure with branches and leaves. As described herein, multiple object trees may be created by a processing algorithm implemented by a general purpose processor. One of the created multiple object trees may be optimized to run on a different processor from the general purpose processor, such as a specialized processing unit. The object tree may, for example, be optimized so that a desired (e.g., an optimal) performance may be achieved when the object tree is processed by the specialized processing unit. As one example, data associated with one of the multiple objects may be converted to a format that provides a desired, e.g., best, performance from the specialized processing unit.

In one exemplary embodiment where the specialized processing unit includes a GPU, a user may specify a graphical scene to be rendered and a first object tree may be created to describe the graphical scene based on the user specification. A second graphics rendering tree may be created, based on the first object tree, where the second graphics rendering tree is optimized to provide a certain performance from the GPU (e.g., a specified performance, a threshold performance, a best performance, an optimum performance, etc.). During this optimization, for example, data in the first object tree may be converted to a format that provides the certain performance from the GPU (e.g., fastest and/or most efficient graphics rendering). In one embodiment, data in each of the objects of the first object tree may be converted to a format that provides the certain performance from the GPU. The GPU may subsequently use the second graphics rendering tree for rendering the graphical scene specified by the user. Use of the optimized graphics rendering tree can enhance the speed and/or efficiency of the overall graphics rendering process. Creation of the graphics rendering tree, which is optimized to the GPU, prior to rendering the graphics, thus, eliminates “on the fly” data/object conversion which can slow down the rendering process.

Changes made to the object tree that describes the graphical scene may be propagated to the graphics rendering tree using an update traversal process described herein. In one implementation, a bit, called a “dirty” bit, may be associated with each object of the object tree. As the user makes changes to the graphical scene, and properties of one or more objects of the object tree are changed to reflect these changes to the graphical scene, the “dirty” bit associated with each object having a changed property is set (e.g., set to true). Subsequent to implementing all of the changes to the object tree, the update traversal process may traverse through each object of the object tree, identify whether each object's “dirty” bit has been set, and add one or more commands to a composite command for each object whose “dirty” bit has been set. The composite command may include multiple “batched” commands that may be individually executed at the time that the composite command is executed to synchronize objects of the graphics rendering tree to the change(s) made in the object tree. The update traversal process, thus, propagates changes made in the object tree to the graphics rendering tree so that the graphical scene, when rendered by the GPU, will include the changes when the graphical scene is rendered.

Optimization of the graphics rendering tree can mean that data associated with a graphics rendering tree has been converted to a format that maximizes the speed and/or efficiency of use of that data by the GPU, and/or that contents of the graphics rendering tree have been organized and/or ordered (e.g., sorted) to increase the speed and/or efficiency of graphics rendering performed by the GPU. “Certain performance” as referred to herein may include a best performance, an optimum performance, a determined or specified performance and/or a threshold performance. A best performance may mean that a speed associated with the execution of a process by a specialized processing unit (e.g., a GPU) is enhanced (e.g., maximized) relative to using an object tree that has not had its data converted to a format the maximizes the speed and efficiency of use of that data by the GPU, or that has not been organized and/or ordered to increase the speed and efficiency of the graphics rendering performed by the GPU.

Overview

FIG. 1A illustrates an overview of an exemplary embodiment involving the generation of multiple object trees for use by respective ones of multiple processing units, where one of the multiple processing units includes a specialized processing unit. In the exemplary embodiment of FIG. 1A, a peer tree of a first object tree is generated that is optimized to provide the certain performance (e.g., best performance) from the specialized processing unit.

As shown in FIG. 1A, a first object tree 100 may be generated based on user input received by a processing algorithm 105, where the contents of object tree 100 may then be used by a processor 125. A peer object tree 110 may be generated, based on the contents of object tree 100, where the contents of peer object tree 110 are optimized to provide the certain performance (e.g., best performance) from specialized processing unit 130. Processing algorithm 105 may include any algorithm that can receive user input and generate an object tree 100 for use by processor 125. Object tree 100 may include one or more objects 115, which may be generated from a library (not shown), a toolbox, or the like, based on the user input and processing algorithm 105. The objects 115 of object tree 100 may be used by processor 125 during algorithm execution. The objects 115 of object tree 100 are depicted as linked in a tree structure. In other implementations, however, objects 115 may be linked as an acyclic graph or any other suitable linking structure.

Processor 125 may include any general purpose processor, such as, for example, a microprocessor or central processing unit (CPU). Specialized processing unit 130 may include a dedicated processing unit designed to perform a specific function. Specialized processing units are typically used to offload time consuming tasks from a central processing unit (CPU). Specialized processing units may perform the offloaded tasks more efficiently then a general purpose CPU or microprocessor. Specialized processing unit 130 may include, for example, a graphics processing unit (GPU), a physics processing unit (PPU), a digital signal processor (DSP), or other type of specialized processing unit. A GPU may include a dedicated graphics rendering device (e.g., for a personal computer, workstation, or game console) that is designed to be efficient at manipulating and displaying computer graphics. A PPU may include a dedicated microprocessor designed to handle physics calculations such as, for example, a physics engine of a video game. Examples of calculations involving a PPU might include rigid body dynamics, soft body dynamics, collision detection, fluid dynamics, finite element analysis, etc. A DSP may include a specialized processor designed to specifically handle digital signal processing.

Peer object tree 110 (including the contents of each object of peer object tree 110) may be generated from object tree 100 using another library (not shown) based on the contents of object tree 100. The contents of peer object tree 110, including the format of data associated with peer object tree 110, are optimized, relative to the contents of object tree 100, for providing the certain performance (e.g., best performance) from specialized processing unit 130. As shown in FIG. 1A, peer object tree 110 may include multiple objects 120. After generation of peer object tree 110, objects 120 may be used by specialized processing unit 130 during algorithm execution. The objects 120 of peer object tree 110 are depicted as linked in a tree structure. In other implementations, however, objects 120 may be linked as an acyclic graph or any other suitable linking structure.

FIG. 1B illustrates an overview of another exemplary embodiment where one of the multiple processors is a GPU. As shown in FIG. 1B, object tree 100 may be generated based on user input received by a graphics processing algorithm 105. The user input received by graphics processing algorithm 105 may select the contents of a specific graphical scene to be displayed and may set the parameters of the graphical scene. A graphics rendering tree 110 may then be generated which is optimized to provide the certain performance (e.g., best performance) from GPU 130 based on the contents of object tree 100. The contents of graphics rendering tree 110, including the format of data associated with graphics rendering tree 110, are optimized, relative to the contents of object tree 100, for providing the certain performance (e.g., best performance) from GPU 130. As shown in FIG. 1B, graphics rendering tree 110 may include multiple objects 120 linked in a tree structure. The correspondence between objects in object tree 100 and graphics rendering tree 110 may be maintained through the use of cookies. A “cookie” as referred to herein refers to a unique identifier that identifies an object of object tree 100 or graphics rendering tree 110. Each object in object tree 100 may have a cookie that refers to its corresponding object in graphics rendering tree 110. Furthermore, each object in graphics rendering tree 110 may have a cookie that refers to its corresponding object in object tree 100. Thus, implementations described herein may use cookies, instead of pointers, for maintaining correspondences between objects of the two trees. In other implementations, other means of pointing from an object in one tree to its corresponding object in the other tree may be used. For example, pointers, a combination of cookies and pointers, or pointers and/or cookies in combination with other means of pointing may be used.

After generation of graphics rendering object tree 110, objects 120 may be used by GPU 130 during graphics rendering. In other implementations, the multiple objects 120 may be linked as an acyclic graph or any other suitable linking structure.

Exemplary Network

FIG. 2 is an exemplary diagram of a network 200 in which systems and methods described herein may be implemented. Network 200 may include one or more clients 210-1 through 210-N (referred to collectively as clients 210 and individually as client 210) that may connect to a server 220 via one or more network(s) 230 using browsers 215-1 through 215-N (referred to collectively as browsers 215 and individually as browser 215). Multiple clients 210 and one server 220 have been illustrated as connected to network(s) 230 for simplicity. In practice, there may be more or fewer clients and servers. Also, in some instances, a client may perform one or more functions of a server and a server may perform one or more functions of a client.

Clients 210 may include devices, such as a personal computer, a wireless telephone (such as a smartphone), a personal digital assistant (PDA), a lap top, a tablet computer, or another type of computation or communication device, a thread or process running on one of these devices, and/or an object executable by one of these devices. Clients 210 may each receive input from respective users, create object trees and corresponding graphics rendering trees, and render graphics based on the graphics rendering trees. Server 220 may include a server device that may, in some implementations, perform various aspects of object tree creation and graphics rendering. For example, in one implementation, client 210 may receive input from a user and send, via browser 215, the input to server 220. Server 220 may receive the input, create the object tree and corresponding graphics rendering tree, and send the object tree and corresponding graphics rendering tree to browser 215. Client 210 may then render, via browser 215, the graphics based on the graphics rendering tree created at server 220.

Network(s) 230 may include one or more networks of any type, including a local area network (LAN); a wide area network (WAN); a metropolitan area network (MAN); a satellite network; a telephone network, such as the Public Switched Telephone Network (PSTN) or a Public Land Mobile Network (PLMN); an intranet, the Internet; or a combination of networks. The PLMN(s) may further include a packet-switched sub-network, such as, for example, General Packet Radio Service (GPRS), Cellular Digital Packet Data (CDPD), or Mobile IP sub-network.

Although FIG. 2 shows exemplary functional components of network 200, in other implementations, network 200 may include fewer, different or additional functional components than those depicted in FIG. 2.

Exemplary Architecture

FIG. 3 is an exemplary diagram of a device 300 that may correspond to client 210 or server 220. Device 300 may include a bus 310, a processor 125, a specialized processing unit 130, a main memory 320, a read only memory (ROM) 330, a storage device 340, an input device 350, an output device 360, and a communication interface 370. Bus 310 may include a path that permits communication among the elements of device 300.

Processor 125 may include a processor, microprocessor, or processing logic that may interpret and execute instructions. Processor 125 may include, for example, a general purpose processor or microprocessor (e.g., a CPU). Specialized processing unit 130 may include a dedicated processing unit designed to perform a specific function, such as, for example, a graphics processing unit (GPU), a physics processing unit (PPU), a digital signal processor (DSP), or another type of specialized processing unit. Main memory 320 may include a random access memory (RAM) or another type of dynamic storage device that may store information and instructions for execution by processor 125 and/or specialized processing unit 130. ROM 330 may include a ROM device or another type of static storage device that may store static information and instructions for use by processor 125 and/or specialized processing unit 130. Storage device 340 may include a magnetic and/or optical recording medium and its corresponding drive.

Input device 350 may include a mechanism that permits an operator to input information to device 300, such as a keyboard, a mouse, a pen, voice recognition and/or biometric mechanisms, etc. Output device 360 may include a mechanism that outputs information to the operator, including a display, a printer, a speaker, etc. Communication interface 370 may include any transceiver-like mechanism that enables device 300 to communicate with other devices and/or systems. For example, communication interface 370 may include mechanisms for communicating with another device or system via a network, such as network(s) 230.

Device 300, consistent with the embodiments described herein, may perform certain operations or processes, as will be described in detail below. Device 300 may perform these operations in response to processor 125 and/or specialized processing unit 130 executing software instructions contained in a computer-readable medium, such as memory 320. A computer-readable medium may be defined as a physical or logical memory device.

The software instructions may be read into memory 320 from another computer-readable medium, such as data storage device 340, or from another device via communication interface 370. The software instructions contained in memory 320 may cause processor 125 and/or specialized processing unit 130 to perform operations or processes that will be described later. Alternatively, hardwired circuitry may be used in place of or in combination with software instructions to implement embodiments described herein. Thus, implementations described herein are not limited to any specific combination of hardware circuitry and software.

Although FIG. 3 shows exemplary functional components of device 300, in other implementations, device 300 may include fewer, different or additional functional components than those depicted in FIG. 3.

Exemplary Functional Diagram

FIG. 4 is an exemplary functional diagram of device 300. The diagram of FIG. 4 depicts functional components that may be implemented by processor 125, or in the case of data or objects, implemented in memory 320, ROM 330 or storage device 340. As depicted in FIG. 4, at a functional level, device 300 may include a technical computing environment (TCE) 410, a graphical user interface (GUI) 420, and libraries A 430-1 through N 430-N.

TCE 410 may include any hardware and/or software based logic that provides a computing environment that allows users to perform tasks related to disciplines, such as, but not limited to, mathematics, science, engineering, medicine, business, etc. In one implementation, TCE 410 may include a dynamically-typed programming language (e.g., the M language) that can be used to express problems and/or solutions in mathematical notations. For example, one or more languages provided in TCE 410 may use an array as a basic element, where the array may not require dimensioning. TCE 410 may be adapted to perform matrix and/or vector formulations that can be used for data analysis, data visualization, application development, simulation, modeling, algorithm development, etc. These matrix and/or vector formulations may be used in many areas, such as statistics, image processing, signal processing, control design, life sciences modeling, discrete event analysis and/or design, state based analysis and/or design, etc.

TCE 410 may further provide mathematical functions and/or graphical tools (e.g., for creating plots, surfaces, images, volumetric representations, etc.). In one implementation, TCE 410 may provide these functions and/or tools using toolboxes (e.g., toolboxes for signal processing, image processing, data plotting, parallel programming, etc.). In another implementation, TCE 410 may provide these functions as block sets. In still another implementation, TCE 410 may provide these functions in another way, such as via a library, etc.

TCE 410 may be implemented as a text-based environment (e.g., MATLAB® (from “The Mathworks”); Octave; Python; Comsol Script; MATRIXx from National Instruments; Mathematica from Wolfram Research, Inc.; Mathcad from Mathsoft Engineering & Education Inc.; Maple from Maplesoft; Extend from Imagine That Inc.; Scilab from The French Institution for Research in Computer Science and Control (INRIA); Virtuoso from Cadence; Modelica or Dymola from Dynasim; Ptolemy from the University of California at Berkeley; etc.), a graphically-based environment (e.g., Simulink®, Stateflow®, SimEvents™, etc., by The MathWorks, Inc.; VisSim by Visual Solutions; LabView® by National Instruments; Dymola by Dynasim; SoftWIRE by Measurement Computing; WiT by DALSA Coreco; VEE Pro or SystemVue by Agilent; Vision Program Manager from PPT Vision; Khoros from Khoral Research; Gedae by Gedae, Inc.; Scicos from (INRIA); Virtuoso from Cadence; Rational Rose from IBM; Rhopsody or Tau from Telelogic; aspects of a Unified Modeling Language (UML) or SysML environment; etc.), or another type of environment, such as a hybrid environment that includes one or more of the above-referenced text-based environments and one or more of the above-referenced graphically-based environments.

GUI 420 may include any type of graphical interface that may receive user input and/or may cause one or more graphics to be rendered for display. For example, GUI 420 may receive user input that selects a type of graphics to be displayed, and the parameters of the graphics, and subsequently cause the graphics to be displayed.

Library A 430-1 may include a library of objects, and associated data, that may be used for constructing an object tree or acyclic graph that, for example, describes a graphical scene. In other implementations, a toolbox may be used instead of, or in addition to, library A 430-1. Library A 430-1 may be accessed to retrieve appropriate objects which can be assembled in the object tree for describing the graphical scene. For example, in one embodiment, library A 430-1 may be accessed based on user input. Various different objects may be stored in library A 430-1 depending on the type of processing algorithm 105 being implemented. If the processing algorithm (e.g., processing algorithm 105) includes a graphics processing algorithm, examples of objects that may be contained in library A 430-1 include (but are not limited to) an “axes” object, a “dataspace” object, a “surface” object, a “ruler” object, a “line” object, a “quadrilateral” object and a “text” object. The “axes” object includes a composite object that groups together a number of simpler objects to provide a better user interface. When an “axes” object is created, one or more additional simpler objects are created including (but not limited to), for example, a “dataspace” object, a “colorspace” object, one or more “ruler” objects, a “box” object and/or a “clipnode” object. These simpler objects may be called “child objects” and the “axes” object may set at least a portion of the properties of these child objects. The properties of the “axes” object, thus, may “pass through” to the properties of the child objects. The “dataspace” object may include properties that control the mapping of data values associated with a graphical scene to coordinates and/or colors. The “surface” object may include properties that control how the “surface” object's peer object in the graphics rendering tree generates a visual representation of a function over a two dimensional parametric domain. The “surface” object may have three properties named “XData,” “YData,” and “ZData.” The “XData” property may specify the X coordinates of columns of the parametric space. The “YData” may specify the Y coordinates of columns of the parametric space. The “XData” and “YData” may include one dimensional vectors with M values in the “YData” and N values in the “XData.” The “ZData” property may define the Z coordinates of the space and may include a two dimensional array with dimensions M×N. The “ruler” object may include properties that control how the “ruler” object's peer object in the graphics rendering tree draws tick marks and labels for one axis of the “Axes” object. The “axes” object may create one ruler for the X axis, another for the Y axis, and another one for the Z axis. The “ruler” object may create two child objects. One of the two child objects may include the “line” object that may include properties that control how the “line” object's peer object in the graphics rendering tree draws the tick marks. The other of the two child objects may include the “text” object that may include properties that control how the “text” object's peer object in the graphics rendering tree draws the labels. The “line” object may include properties that control how the “line” object's peer object in the graphics rendering tree renders one or more continuous or disjoint line segments. The “quadrilateral” object may include properties that control how the “quadrilateral” object's peer object in the graphics rendering tree draws three dimensional coordinates and fills the interior of a bounding quadrilateral. The “quadrilateral” object may also control how the “quadrilateral” object's peer object in the graphics rendering tree fills the interior of a bounding quadrilateral with a solid color, interpolates four input colors, or performs lighting calculations. The “text” object may include properties that control how the “text” object's peer object in the graphics rendering tree draws characters to the screen in the graphical scene.

Library N 430-N may include another library of objects, and associated data, that may be used for constructing a peer object tree, such as, for example, graphics rendering tree 110, that may be used by a GPU for rendering the graphical scene described by the object tree. In other implementations, a toolbox may be used instead of, or in addition to, library N 430-N. Library N 430-N may be accessed to retrieve appropriate objects, based on the contents of the corresponding object tree, which can be assembled in the graphics rendering object tree for use by the GPU. Various different objects may be stored in library N 430-N depending on the type of processing algorithm 105 being implemented. The contents of library N 430-N may be changed due to, for example, changing performance characteristics of the specialized processing unit (e.g., the GPU). In other implementations, another library may be “ported” to enable the use of different objects in the peer object tree (e.g., graphics rendering tree). If the processing algorithm includes a graphics processing algorithm, examples of objects that may be contained in library N 430-N include (but are not limited to) a “viewport” object, a “camera” object, a “group” object and a “geode” object.

A “viewport” object may include functionality for controlling the size and position of the window in which the graphical scene is rendered. A “camera” object may include functionality for transforming a given coordinate system to the rendering system coordinates. For example, a “camera” object may define a mapping from three dimensional world coordinates to two dimensional coordinates within the current viewport. A “group” object may act as a placeholder so that the structure of the object tree and peer object tree match. A “geode” object may include functionality for causing aspects of the graphical scene to be drawn (e.g., points, lines, triangles or quadrilaterals).

Although FIG. 4 shows exemplary functional components of device 300, in other implementations, device 300 may include fewer, different or additional functional components than those depicted in FIG. 4.

Exemplary Tree Creation Process

FIG. 5 is a flowchart of an exemplary process for creating object trees for use in describing a graphical scene and for rendering the graphical scene via a GPU. In one implementation, the process exemplified by FIG. 5 may be performed by processor 125 of a client 210. In another implementation, the process exemplified by FIG. 5 may be performed by processor 125 of server 220. In a further implementation, blocks 500 and 510 of FIG. 5 may be performed by processor 125 of a client 210 and block 520 may be performed by processor 125 of server 220.

The exemplary process may begin with the receipt of user input regarding a graphical scene (block 500). The user input may specify a type of graphical scene that is to be rendered, including parameters associated with the graphical scene. For example, the graphical scene may be a three dimensional graph and the parameters may include x, y and z values that are to be plotted in the three dimensional graph. The user may, for example, use a graphical user interface (GUI) at client 210 to enter the user data for specifying the graphical scene. GUI 600 may be displayed by browser 215. FIG. 6 illustrates an exemplary GUI 600 that a user may use to enter data for specifying the graphical scene. The GUI, similar to GUI 600 shown in FIG. 6, may include various fields, windows, or data entry portions that permit the user to enter the input regarding the graphical scene. The GUI may include fields, windows or data entry portions for entering or identifying graphical scene parameters, labels, etc.

An object tree may be created, using library A 430-1, based on the user input to describe the graphical scene (block 510). Library A 430-1 may be used to retrieve appropriate objects to describe the graphical scene specified by the user, with properties of the retrieved objects being set based on the parameters provided by the user. FIG. 7 illustrates an object tree 700 of one exemplary embodiment that includes objects 710-1 through 710-7 (collectively referred to herein as “objects 710”) linked together in a tree structure. When object tree 700 is created, data associated with objects 710 of object tree 700 may be in a format used by the processing algorithm, but not in a format that provides a certain performance (e.g., best performance) from the GPU.

Exemplary embodiments may create another structure, e.g., a tree, contemporaneously with object tree 700, where the created structure is optimized for a certain performance (e.g., best performance) from the GPU. For example, a graphics rendering tree may be created, contemporaneously with the creation of the object tree, using library N 430-N, based on the object tree (block 520). Each object in the object tree (e.g., objects 710-1 through 710-7) may have one or more corresponding graphics rendering objects (e.g., graphics rendering objects 810-1A through 810-7) that may be retrieved from library N 430-N. Each corresponding graphics rendering object may be optimized to provide the certain performance (e.g., best performance) from the GPU. For example, data associated with each graphics rendering object may be converted to a format that provides the certain performance from the GPU. The properties of each graphics rendering object may be set based on the user input and/or based on data associated with the object tree. Each of the graphics rendering objects may be linked together to form a graphics rendering tree. FIG. 8 illustrates the creation of an exemplary graphics rendering tree 800 based on object tree 700. As shown in FIG. 8, each object 710 of object tree 700 has one or more corresponding objects 810 in graphics rendering tree 800.

Exemplary Graphics Rendering Tree Creation Process

FIG. 9 is a flowchart of exemplary details for creating a graphics rendering tree based on a corresponding object tree. The exemplary process of FIG. 9 provides further details of the graphics rendering tree creation block (block 520) of FIG. 5. The process exemplified by FIG. 9 may be performed by either processor 125 of client 210 or processor 125 of server 220.

The exemplary process may begin with the creation of a composite command (block 900). As shown in FIG. 10, an update visitor 1000 may be created that further creates a composite command 1010 into which multiple commands may be inserted for creating the eventual graphics rendering tree. Update visitor 1000 may include a software entity that may traverse the object tree to add one or more commands to composite command 1010. The grouping of commands in composite command 1010 ensures that the graphics rendering tree has been completely created, and is not in an intermediate state of creation, in the case where processor 125 of client 210 or server 220 may be responding to events external to the creation of the graphics rendering tree. During creation of the graphics rendering tree, processor 125 may respond to events from other sources (e.g., requests to repaint the window from the operating system) and these could potentially be executed between any two commands. In between some of these commands, the graphics rendering tree is in an intermediate state, and the window should not be re-painted while the tree is in such a state. Grouping all of the commands for creating the graphics rendering tree into a single composite command ensures that requests from other sources are executed only at times in which the graphics rendering tree is in a valid state. Therefore, a composite command may include all of the commands that are needed to create the graphics rendering tree. In other implementations, multiple composite commands may be used in place of the single composite command. For example, one composite command may be used for creating a first set of objects in the graphics rendering tree and another composite command may be used for creating a second set of objects in the graphics rendering tree.

The objects of the object tree may be traversed and one or more commands may be added to the composite command for each object in the object tree (block 910). As illustrated in FIGS. 11-17, update visitor 1000 may visit each of objects 710-1 through 710-7 of object tree 700 and insert one or more appropriate commands into composite command 1010 that can be used to create the graphics rendering tree. The specific command or commands, and the content of the specific command or commands, for a given object of the object tree may be selected based on library N 430-N. As first shown in FIG. 11, update visitor 1000 may visit object 710-1 of object tree 700. Based on object 710-1 and library N 430-N, update visitor 1000 may insert a “create node command” 1100 into composite command 1010 which may be subsequently used to create objects 810-1A and 810-1B in the graphics rendering tree. FIG. 12 further illustrates update visitor 1000 visiting object 710-2 of object tree 700. Based on object 710-2, update visitor 1000 may insert another “create node command” 1200 into composite command 1010. Update visitor 1000 may additionally insert an “insert child command” 1210 into composite command 1010. The commands 1200 and 1210 may be subsequently used to create object 810-2 in the graphics rendering tree.

FIG. 13 illustrates update visitor 1000 visiting object 710-3 of object tree 700. Based on object 710-3, update visitor may insert another “create node command” 1300 and “insert child command” 1310 into composite command 1010. The commands 1300 and 1310 may be subsequently used to create object 810-3 in the graphics rendering tree. FIG. 14 illustrates update visitor 1000 visiting object 710-4 of object tree 700. Based on object 710-4, update visitor 1000 may insert another “create node command” 1400 and “insert child command” 1410 into composite command 1010. The commands 1400 and 1410 may be subsequently used to create object 810-4 in the graphics rendering tree. As further shown in FIG. 15, update visitor 1000 may visit object 710-5 of object tree 700. Based on object 710-5, update visitor 1000 may insert a “create node command” 1500 and “insert child command” 1510 into composite command 1010. The commands 1500 and 1510 may be subsequently used to create object 810-5 in the graphics rendering tree.

FIG. 16 illustrates update visitor 1000 visiting object 710-6 of object tree 700, which is the next to last object of object tree 700 to be traversed. Based on object 710-6, update visitor 1000 may insert another “create node command” 1600 and “insert child command” 1610 into composite command 1010. The commands 1600 and 1610 may subsequently be used to create object 810-6 in the graphics rendering tree. FIG. 17 additionally illustrates update visitor 1000 visiting object 710-7 of object tree 700. Based on object 710-7, update visitor 1000 may insert another “create node command” 1700 and “insert child command” 1710 into composite command 1010. The commands 1700 and 1710 may be subsequently used to create object 810-7 in the graphics rendering tree.

During object tree traversal, selected object data may be converted to a format that provides a certain performance from the GPU (block 920). In one embodiment, the certain performance may include a best performance. As an example, during traversal of object 710-3 of object tree 700 (shown in FIG. 13), data associated with object 710-3 may be converted from a first data format to a second data format that is optimized for use with a GPU. As shown in FIG. 18A, object 710-3 may include three arrays of data, Z data 1800, X data 1810 and Y data 1820 that represent object data points. As further depicted in FIG. 18A, Z data 1800 may include an array of double precision values, X data 1810 may include an array of 32 bit integer values and Y data 1820 may include an array of 32 bit integer values. As also shown in FIG. 18B, Z data 1800, X data 1810 and Y data 1820 may be converted to an array 1830 of single precision floating point numbers that may be set as values in object 710-4 and to an array 1840 of single precision floating point numbers that may be set as values in object 710-5. The exemplary data format conversion depicted in FIGS. 18A and 18B may be repeated for appropriate objects of object tree 700 to convert the data associated with those objects to a format that provides a certain performance (e.g., best performance) from the GPU.

Upon complete object tree traversal, the various constituent commands of the composite command may be executed to create the graphics rendering tree (block 930). For example, as illustrated in FIGS. 19-25, each command of composite command 1010 may be executed to create graphics rendering object tree 800. In one implementation, the commands of composite command 1010 may be executed sequentially. FIG. 19 illustrates “create node command” 1100 being executed to create objects 810-1A and 810-1B in graphics rendering tree 800. FIG. 20 further illustrates “create node command” 1200 and “insert child command” 1210 being executed to create object 810-2 in graphics rendering object tree 800. FIG. 21 additionally illustrates “create node command” 1300 and “insert child command” 1310 being executed to create object 810-3 in graphics rendering object tree 800. FIG. 22 further illustrates “create node command” 1400 and “insert child command” 1410 being executed to create object 810-4 in graphics rendering object tree 800. FIG. 23 also illustrates “create node command” 1500 and “insert child command” 1510 being executed to create object 810-5 in graphics rendering object tree 800. FIG. 24 additionally depicts “create node command” 1600 and “insert child command” 1610 being executed to create object 810-6 in graphics rendering object tree 800. FIG. 25 further depicts “create node command” 1700 and “insert child command” 1710 being executed to create object 810-7 in graphics rendering object tree 800.

Exemplary Object Tree/Graphics Rendering Tree Update Process

FIG. 26 is a flowchart of an exemplary process for updating a graphics rendering tree after changes or updates have been made to the graphics rendering tree's corresponding object tree. The exemplary process of FIG. 26 may be implemented by processor 125 of client 210 or server 220.

The exemplary process may begin when changes are made to one or more properties of one or more objects of the object tree (e.g., objects 115 of object tree 100) (block 2600). For example, a user that created a graphics plot for rendering on a display device may change a parameter/property associated with the plot. As examples, the user may change a color associated with an aspect of the graphics plot, may change dimensions of one or more axes of the graphics plot, or may change labels associated with the graphics plot. The user may change any number of properties/parameters associated with the graphical scene to be rendered.

A “dirty” bit, associated with the object(s) in the object tree having one or more changed properties, may be set (block 2610). The “dirty” bit may, for example, be changed from a bit value of zero to a bit value of one. For each object having one or more properties changed in block 2600, a “dirty” bit associated with that object may be set. For example, as shown in the illustrative example of FIG. 27, an object 710-1 of object tree 700, having a property that has been changed by a user, may have its “dirty” bit 2700-1 set (e.g., changed from “0” to “1”).

An update traversal of the object tree may be performed to change one or more properties of corresponding objects in the graphics rendering tree (e.g., tree 110) (block 2620). The update traversal may include visiting each of the objects of the object tree, determining whether its associated “dirty” bit has been set and adding one or more commands to a composite command. For example, a command such as a “create node” command, which may create an object in the graphics rendering tree, or an “insert child” command, which may associate an object as a child of another object, may be added to the composite command. Executing the composite command may propagate changes in the object tree across to corresponding objects in the graphics rendering tree. By using “dirty” bits to indicate that updates or changes have been made, only commands corresponding to modified objects may be included in the composite command. Use of “dirty” bits, as described herein, thus, may allow the update traversal to be performed only for those objects whose “dirty” bit has been set. “Dirty” bits, as described herein, therefore, permit an efficient propagation of changes in the object tree to the graphics rendering tree. The exemplary process of FIG. 28 below describes further details of this update traversal.

Exemplary Update Traversal Process

FIG. 28 is a flowchart of an exemplary process of performing the update traversal of an object tree to revise the corresponding graphics rendering tree. The exemplary process of FIG. 28 describes details of block 2620 of FIG. 26. The exemplary process of FIG. 28 may be implemented by processor 125 of client 210 or server 220.

The exemplary process may begin with stepping through each object of the object tree (e.g., tree 100) (block 2800). For example, referring to the example object tree 700 of FIG. 27, object tree 700 may be stepped through to visit each object 710-1, 710-2, 710-3, 710-4, 710-5, 710-6 and 710-7 of the tree. Object tree 700 may, for example, be traversed by starting at the top object in the tree and stepping downwards through each branch in the tree in order. For example, update traversal of object tree 700 of FIG. 27 may include stepping through the objects of the tree in the following order: object 710-1, object 710-2, object 710-3, object 710-4, object 710-5, object 710-6 and object 710-7. At each object of object tree 100, a “dirty” bit associated with each object may be checked to determine if it is set (block 2810). For example, checking the “dirty” bits of object tree 700 of FIG. 27 may include checking the “dirty” bits in the following order: bit 2700-1, bit 2700-2, bit 2700-3, bit 2700-4, bit 2700-5, bit 2700-6, bit 2700-7.

An update method may be executed for each object of object tree 100 whose “dirty” bit has been set to insert appropriate commands into a composite command (block 2820). As each object of the object tree is traversed, one or more appropriate commands may be inserted into the composite command for revising that object's counterpart object in the graphics rendering tree. Execution of an update method for a given object of object tree 100 whose “dirty” bit has been set may also set the properties of child objects that are below that given object in the object tree, thus, causing the “dirty” bits associated with those child objects to be set.

Once each object in object tree 100 has been traversed, the composite command may be executed to revise the appropriate object(s) of the graphics rendering tree (block 2830). For each object in the object tree that has had at least one property changed, the composite command, which may include one or more commands related to each object in the graphics rendering tree, may be executed to revise the counterpart objects in the graphics rendering tree.

FIGS. 29-32B graphically illustrate one example of the exemplary process of FIG. 28, as applied to object tree 700. In the example of FIGS. 29-32B, a property on the “surface” object, object 710-3, has been changed. For example, a color property associated with object 710-3 has been changed from yellow to red. As shown in FIG. 29, an update visitor 2900 may be created for checking the “dirty” bits associated with each object of tree 700, and for generating a composite command that can be used to revise the graphics rendering tree. Update visitor 2900 may include a software entity that may traverse object tree 700. FIG. 29 depicts update visitor 2900 checking “dirty” bit 2910-1 associated with the first object, object 710-1, in tree. Since “dirty” bit 2910-1 is not set (e.g., indicating that no changes to any properties of object 710-1 have been made), update visitor 2900 traverses to the next object in tree 700—object 710-2, as shown in FIG. 30.

Since “dirty” bit 2910-2 associated with object 710-2 is not set, as depicted in FIG. 30, update visitor 2900 traverses to object 710-3 to check “dirty” bit 2910-3, as further shown in FIG. 31B. A check of “dirty” bit 2910-3 by update visitor 2900 determines that a change has been made to object 710-3 (e.g., “dirty” bit 2910-3 has been set) and, therefore, update visitor 2900 calls an update method associated with object 710-3. The update method, as shown in FIG. 31B, inserts commands 3105, 3110, 3115 and 3120 into composite command 3100. Command 3105 may, when executed, creates a new object for graphics rendering tree 110 that corresponds to the changes made in object 710-3. Command 3110 may, when executed, cause the peer objects of object 710-3's children to be newly associated with the new object created by command 3105. Command 3115 may, when executed, replace the old peer of object 710-3 with the new object in a child list associated with object 710-2's peer in the graphics rendering tree. Command 3120 may, when executed, destroy the old peer of object 710-3. As further depicted in FIG. 31C, update visitor 2900 may set “dirty” bit 2910-5 of object 710-5 to indicate that its parent object has been changed and that object 710-5 needs to be updated. As also shown in FIG. 31D, update visitor 2900 may re-set “dirty” bit 2910-3 associated with object 710-3.

Update visitor 2900 may traverse to object 710-4 and a check of “dirty” bit 2910-4 by update visitor 2900 determines that a change has not been made to object 710-4. Update visitor 2900 may then traverse to object 710-5 and may perform a check of “dirty” bit 2910-5. The check of “dirty” bit 2910-5 by update visitor 2900 may determine that a change has been made to object 710-5 (e.g., “dirty” bit 2910-5 has been set). Update visitor 2900 may, therefore, call an update method associated with object 710-5. The update method, as shown in FIG. 32A, inserts commands 3205, 3210 and 3215 into composite command 3100. Command 3205 may, when executed, create a new object for graphics rendering tree 110 that corresponds to the changes made in object 710-3. Command 3210 may, when executed, replace the old peer of object 710-5 with the new object in a child list associated with object 710-3's peer in the graphics rendering tree. Command 3215 may, when executed, destroy the old peer of object 710-5. As further depicted in FIG. 32B, update visitor 2900 may then re-set object 710-5's “dirty” bit 2910-5. Update visitor 2900 may then traverse the remaining objects in tree 700 but, since as shown in FIG. 32B, none of “dirty” bits 2910-6 and 2910-7 have been set, no further update methods are called.

With completion of the traversal of object tree 700, composite command 3100 may be executed to revise the graphics rendering tree. For example, as illustrated in the examples of FIGS. 33A-34B, each command of composite command 3100 may be executed in sequence to revise graphics rendering object tree 800. FIG. 33A illustrates “create node command” 3105 being executed to create object 3125. FIG. 33B further illustrates “reparent children command” 3110 being executed to move the child objects 810-4 and 810-5 to associate them with new object 3125. FIG. 33C additionally depicts “replace child command” 3115 and “destroy node command” 3120 being executed to swap new object 3125, and its newly associated child objects 810-4 and 810-5, into object tree 800 such that object 3125 now is a child of object 810-2, and to remove (destroy) old object 810-3 from tree 800.

“Create node command” 3205 may then be executed, as depicted in FIG. 34A, to create object 3220. As further shown in FIG. 34B, “replace child command” 3210 and “destroy node command” 3215 may be executed to swap new object 3220 into object tree 800 such that object 3220 is now a child of object 3125, and to remove (destroy) old object 810-4 from tree 800. Graphics rendering tree 800 has now been revised to reflect the changes made to object tree 700.

Exemplary Graphics Rendering Process

FIG. 35 is a flowchart of an exemplary process for rendering graphics based on a previously created graphics rendering tree. Block 3500 of FIG. 35 may be implemented by specialized processing unit 130 (e.g., a GPU) of a client 210 or server 220, and blocks 3510 and 3520 of FIG. 35 may be implemented by processor 125 of client 210 or server 220.

The exemplary process may begin with the GPU rendering the graphics using the previously created, or revised, graphics rendering tree (block 3500). For example, as shown in FIG. 36, the GPU may render a plot 3600 based on the graphics rendering tree 800 of FIG. 25 or 34B. In one implementation, plot 3600 may be displayed by browser 215, as shown in FIG. 37. Prior to the GPU rendering the graphics using the previously created, or revised, graphics rendering tree, the contents of the graphics rendering tree may be re-ordered so that state changes can be minimized. For example, state attribute sorting may be used to re-order the contents of the graphics rendering tree prior to the GPU rendering the graphics. Because the GPU typically is deeply “pipelined,” the speed of the graphics rendering may be significantly slowed when there are many changes in state. Therefore, improvements in performance (e.g., graphics rendering speed) may be obtained by rendering objects that have the same state together. For example, if a graphics scene uses many objects that have a same state (e.g., a same texture map), better performance may be obtained from the GPU if all of these objects are rendered together instead of switching between these and other objects.

User interaction with the rendered graphics may be subsequently received (block 3510). For example, the user may select a different view of the plot 3600. As another example, “mouse” motion events (i.e., movement of the mouse by the user) may change view parameters of a graphical scene. Objects of the object tree may be used to perform scripted actions based on the user interaction (block 3520). For example, in response to the above-described “mouse” motion events, the graphical scene may be redrawn and updated view parameters may be sent back to an object in the object tree.

CONCLUSION

Implementations described herein provide illustration and description, but is not intended to be exhaustive or to limit the invention to the precise form disclosed. Modifications and variations are possible in light of the above teachings, or may be acquired from practice of the invention. For example, a phone or tablet computer may run a dedicated application for rendering the graphical scenes.

While a series of blocks have been described with regard to FIGS. 5, 9, 26, 28 and 35, the order of the blocks may be modified in other implementations. Further, non-dependent blocks may be performed in parallel. Some implementations have been described herein with respect to a graphics rendering tree being organized and optimized for use by a GPU. However, it will be appreciated that the embodiments described herein may be equivalently applied to peer object trees organized and optimized for use with other specialized processing units, such as, for example, PPUs or DSPs. Additionally, implementations have been described herein with respect to a general purpose CPU and a specialized processing unit. In other implementations, a first object tree may be associated with a first type of CPU and a second object tree may be associated with a second type of CPU, where the second type of CPU may be faster and/or have additional capabilities as compared to the first type of CPU. Furthermore, in other implementations, the first object tree and the second object tree may be associated with a single CPU, where the single CPU may utilize both of the first and second object trees. Update traversal has been described herein as setting “dirty” bits associated with each object whose properties have been changed, and then visiting each object in the object tree, checking each object's “dirty” bit to determine if the object's properties have been changed, and adding one or more commands to the composite command for each object whose “dirty” bit has been set. However, in other implementations, only a subset of objects of the set of objects that have had their properties changed may have their associated “dirty” bits set. Additionally, in other implementations, a subset of objects of the set of objects whose “dirty” bit has been set may only be visited during update traversal (i.e., not all of the objects whose “dirty” bit has been set are visited).

Logic for practicing the object tree update traversal technique, and other aspects described herein, may be provided to a client via a license. This license may, in some implementations, be tiered so that users have varying degrees of flexibility and/or speed based on the licenses that they have.

It will be apparent that aspects described herein may be implemented in many different forms of software, firmware, and hardware in the implementations illustrated in the figures. The actual software code or specialized control hardware used to implement these aspects is not limiting of the invention. Thus, the operation and behavior of the aspects have been described without reference to the specific software code, it being understood that software and control hardware could be designed to implement the aspects based on the description herein.

No element, act, block or instruction used in the present application should be construed as critical or essential to the invention unless explicitly described as such. Also, as used herein, the article “a” is intended to include one or more items. Where only one item is intended, the term “one” or similar language is used. Further, the phrase “based on” is intended to mean “based, at least in part, on” unless explicitly stated otherwise. 

What is claimed is:
 1. A non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions, executable by at least one processor, to create a first set of objects in a first structure based on first data, the first set of objects describing a graphical scene specified by the first data; one or more instructions, executable by the at least one processor, to add a command for at least one object, of the first set of objects, to a composite command, the composite command including commands for the graphical scene; one or more instructions, executable by the at least one processor, to create a second set of objects in a second structure based on the first set of objects in the first structure and the composite command; one or more instructions, executable by the at least one processor, to receive second data; one or more instructions, executable by the at least one processor, to change one or more objects of the first set of objects based on the second data; one or more instructions, executable by the at least one processor, to change one or more objects of the second set of objects based on the changes to the one or more objects of the first set of objects; and one or more instructions, executable by the at least one processor, to provide the changed second set of objects to a browser for rendering a new graphical scene.
 2. The non-transitory computer-readable medium of claim 1, where the instructions further comprise: one or more instructions to associate a bit with each of the objects in the first structure; and one or more instructions to set the bit associated with each of the objects in the first structure to indicate that the one or more objects in the first set of objects have been changed.
 3. The non-transitory computer-readable medium of claim 1, where the instructions further comprise: one or more instructions to create the objects of the first set of objects from objects defined in a first library; and one or more instructions to create the objects of the second set of objects from objects defined in a second library.
 4. The non-transitory computer-readable medium of claim 1, where at least one of the first structure or the second structure comprises one of a tree or a directed acyclic graph.
 5. The non-transitory computer-readable medium of claim 1, where the first set of objects and second set of objects are created at a server, the instructions further comprising: one or more instructions to provide for rendering the new graphical scene for display, on the browser, at a client that is remote from the server.
 6. The non-transitory computer-readable medium of claim 1, where the one or more instructions to create the second set of objects include: one or more instructions to create the second set of objects contemporaneously with the creation of the first set of objects.
 7. The non-transitory computer-readable medium of claim 1, where the instructions further comprise: one or more instructions to associate information with at least one object of the first set of objects; one or more instructions to update at least one object of the first set of objects based on the associated information; and one or more instructions to update at least object of the second set of objects based on the updated at least one object of the first set of objects.
 8. A method performed by a computer device, the method comprising: creating a first set of objects in a first structure based on first data, the first set of objects describing a graphical scene specified by the first data, the creating the first set of objects being performed by the computer device; adding a command for at least one object, of the first set of objects, to a composite command, the composite command including commands for the graphical scene, the adding being performed by the computer device; creating a second set of objects in a second structure based on the first set of objects in the first structure and the composite command, the creating the second set of objects being performed by the computer device; receiving second data, the receiving being performed by the computer device; changing one or more objects of the first set of objects based on the second data, the changing the one or more objects of the first set of objects being performed by the computer device; changing one or more objects of the second set of objects based on the changes to the one or more objects of the first set of objects, the changing the one or more objects of the second set of objects being performed by the computer device; and providing the changed second set of objects to a browser for rendering a new graphical scene, the providing being performed by the computer device.
 9. The method of claim 8, further comprising: associating a bit with each of the objects in the first structure; and setting the bit associated with each of the objects in the first structure to indicate that the one or more objects in the first set of objects have been changed.
 10. The method of claim 8, further comprising: creating the objects of the first set of objects from objects defined in a first library; and creating the objects of the second set of objects from objects defined in a second library.
 11. The method of claim 8, where at least one of the first structure or the second structure comprises one of a tree or a directed acyclic graph.
 12. The method of claim 8, where the first set of objects and second set of objects are created at a server, the method further comprising: providing for rendering the new graphical scene for display, on the browser, at a client that is remote from the server.
 13. The method of claim 8, where the second set of objects is created contemporaneously with the creation of the first set of objects.
 14. The method of claim 8, further comprising: associating information with at least one object of the first set of objects; updating at least one object of the first set of objects based on the associated information; and updating at least object of the second set of objects based on the updated at least one object of the first set of objects.
 15. A system comprising: a processor; and a memory coupled to the processor, the memory storing instructions that, when executed by the processor, cause the processor to: create a first set of objects in a first structure based on first data, the first set of objects describing a graphical scene specified by the first data; add a command for at least one object, of the first set of objects, to a composite command, the composite command including commands for the graphical scene; create a second set of objects in a second structure based on the first set of objects in the first structure and the composite command; receive second data; change one or more objects of the first set of objects based on the second data; change one or more objects of the second set of objects based on the changes to the one or more objects of the first set of objects; and provide the changed second set of objects to a browser for rendering a new graphical scene.
 16. The system of claim 15, where the processor is further to: associate a bit with each of the objects in the first structure; and set the bit associated with each of the objects in the first structure to indicate that the one or more objects in the first set of objects have been changed.
 17. The system of claim 15, where the processor is further to: create the objects of the first set of objects from objects defined in a first library; and create the objects of the second set of objects from objects defined in a second library.
 18. The system of claim 15, where at least one of the first structure or the second structure comprises one of a tree or a directed acyclic graph.
 19. The system of claim 15, where the first set of objects and the second set of objects are created at a server and the processor is further to: provide for rendering the new graphical scene for display, on the browser, at a client that is remote from the server.
 20. The system of claim 15, where the processor is further to: associate information with at least one object of the first set of objects; update at least one object of the first set of objects based on the associated information; and update at least object of the second set of objects based on the updated at least one object of the first set of objects. 